The Structure of Self-dual Plane Graphs with Maximum Degree 4 Jack E. Graver and Elizabeth J. Hartung
نویسنده
چکیده
Self-dual plane graphs have been studied extensively. C. A. B Smith and W. T. Tutte published A class of self-dual maps in 1950 [9]; in 1992, Archdeacon and Richter [1] described a method for constructing all self-dual plane graphs and a second construction was produced by Servatius and Christopher [5] in 1992. Both constructions are inductive. In this paper, we produce four templates from which all self-dual plane graphs with maximum degree 4 (self-dual spherical grids) can be constructed. The self-dual spherical grids are further subdivided into 27 basic automorphism classes. Self-dual spherical grids in the same automorphism class have similar architecture. A smallest example of each class is constructed.
منابع مشابه
Self-dual Spherical Grids
Self-dual plane graphs have been studied extensively. C. A. B Smith and W. T. Tutte published A class of self-dual maps in 1950 [9]; in 1992, Archdeacon and Richter [1] described a method for constructing all self-dual plane graphs and a second construction was produced by Servatius and Christopher [5] in 1992. Both constructions are inductive. In this paper, we produce four templates from whic...
متن کاملThe independence numbers of fullerenes and benzenoids
We explore the structure of the maximum vertex independence sets in fullerenes: plane trivalent graphs with pentagonal and hexagonal faces. At the same time, we will consider benzenoids: plane graphs with hexagonal faces and one large outer face. In the case of fullerenes, a maximum vertex independence set may constructed as follows: (i) Pair up the pentagonal faces. (ii) Delete the edges of a ...
متن کاملKekulé structures and the face independence number of a fullerene
We explore the relationship between Kekulé structures and maximum face independence sets in fullerenes: plane trivalent graphs with pentagonal and hexagonal faces. For the class of leap-frog fullerenes, we show that a maximum face independence set corresponds to a Kekulé structure with a maximum number of benzene rings and may be constructed by partitioning the pentagonal faces into pairs and 3...
متن کاملLINEAR ALGEBRA AND ZTSAPPLZCATZONS 10 , 111 - 128 ( 1975 ) Boolean
In this paper we consider a variety of questions in the context of Boolean designs. For example, ErdGs asked: How many subsets of an n-set can be found so that pairwise their intersections are all even (odd)? E. Berlekamp [2] and the author both answered this question; the answer is approximately 2[b”‘. Another question which can be formulated in terms of Boolean designs was asked by J. A. Bond...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کامل